1,457 research outputs found

    Zero-gravity movement studies

    Get PDF
    The use of computer graphics to simulate the movement of articulated animals and mechanisms has a number of uses ranging over many fields. Human motion simulation systems can be useful in education, medicine, anatomy, physiology, and dance. In biomechanics, computer displays help to understand and analyze performance. Simulations can be used to help understand the effect of external or internal forces. Similarly, zero-gravity simulation systems should provide a means of designing and exploring the capabilities of hypothetical zero-gravity situations before actually carrying out such actions. The advantage of using a simulation of the motion is that one can experiment with variations of a maneuver before attempting to teach it to an individual. The zero-gravity motion simulation problem can be divided into two broad areas: human movement and behavior in zero-gravity, and simulation of articulated mechanisms

    Estimating Dynamic Traffic Matrices by using Viable Routing Changes

    Get PDF
    Abstract: In this paper we propose a new approach for dealing with the ill-posed nature of traffic matrix estimation. We present three solution enhancers: an algorithm for deliberately changing link weights to obtain additional information that can make the underlying linear system full rank; a cyclo-stationary model to capture both long-term and short-term traffic variability, and a method for estimating the variance of origin-destination (OD) flows. We show how these three elements can be combined into a comprehensive traffic matrix estimation procedure that dramatically reduces the errors compared to existing methods. We demonstrate that our variance estimates can be used to identify the elephant OD flows, and we thus propose a variant of our algorithm that addresses the problem of estimating only the heavy flows in a traffic matrix. One of our key findings is that by focusing only on heavy flows, we can simplify the measurement and estimation procedure so as to render it more practical. Although there is a tradeoff between practicality and accuracy, we find that increasing the rank is so helpful that we can nevertheless keep the average errors consistently below the 10% carrier target error rate. We validate the effectiveness of our methodology and the intuition behind it using commercial traffic matrix data from Sprint's Tier-1 backbon

    Bringing the Personal into Public Life: How Relational Morality and Meaningful Action Can Enrich an Organization’s Work

    Get PDF
    While an overly detached perspective dominates contemporary discourse on development and other public projects, an alternative approach, built on a personal perspective, can enrich an organization’s work. Organizations can bring elements of a personal perspective into the public realm, employing the virtues of relational morality and restoring the possibility for meaningful action. Narrative accounts from many people who have experienced The Tandana Foundation’s work show how one organization has brought a personal approach to collective work, generating positive results. While emphasizing the personal aspects is important to counterbalance the dominance of a detached perspective, it is important to bring elements of both perspectives together in order to steer between the converse excesses of instrumentalism or alienation and pettiness or parochialism. As organizations like The Tandana Foundation, as well as other NGOs, institutions, and businesses, apply a personal vocabulary to public life, they reclaim space for agency and meaningful action

    A Two-step Statistical Approach for Inferring Network Traffic Demands (Revises Technical Report BUCS-2003-003)

    Full text link
    Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a complete set of these demands is prohibitively expensive because of the huge amounts of data that must be collected and the performance impact that such measurements would impose on the regular behavior of the network. As a consequence, we must rely on statistical techniques to produce estimates of actual traffic demands from partial information. The performance of such techniques is however limited due to their reliance on limited information and the high amount of computations they incur, which limits their convergence behavior. In this paper we study a two-step approach for inferring network traffic demands. First we elaborate and evaluate a modeling approach for generating good starting points to be fed to iterative statistical inference techniques. We call these starting points informed priors since they are obtained using actual network information such as packet traces and SNMP link counts. Second we provide a very fast variant of the EM algorithm which extends its computation range, increasing its accuracy and decreasing its dependence on the quality of the starting point. Finally, we evaluate and compare alternative mechanisms for generating starting points and the convergence characteristics of our EM algorithm against a recently proposed Weighted Least Squares approach.National Science Foundation (ANI-0095988, EIA-0202067, ITR ANI-0205294

    Projective quantum spaces

    Get PDF
    Associated to the standard SUq(n)SU_{q}(n) R-matrices, we introduce quantum spheres Sq2n−1S_{q}^{2n-1}, projective quantum spaces CPqn−1CP_{q}^{n-1}, and quantum Grassmann manifolds Gk(Cqn)G_{k}(C_{q}^{n}). These algebras are shown to be homogeneous quantum spaces of standard quantum groups and are also quantum principle bundles in the sense of T Brzezinski and S. Majid (Comm. Math. Phys. 157,591 (1993)).Comment: 8 page

    A Pragmatic Definition of Elephants in Internet Backbone Traffic

    Get PDF
    Studies of the Internet traffic at the level of network prefixes, fixed length prefixes, TCP flows, AS’s, and WWW traffic, have all shown that a very small percentage of the flows carries the largest part of the information. This behavior is commonly referred to as “the elephants and mice phenomenon”. Traffic engineering applications, such as re-routing or load balancing, could exploit this property by treating elephant flows differently. In this context, though, elephants should not only contribute significantly to the overall load, but also exhibit sufficient persistence in time. The challenge is to be able to examine a flow’s bandwidth and classify it as an elephant based on the data collected across all the flows on a link. In this paper, we present a classification scheme that is based on the definition of a separation threshold, that elephants have to exceed. We introduce two single-feature classification schemes, and show that the resulting elephants are highly volatile. We then propose a two-feature classification scheme that incorporates temporal characteristics and show that this approach is more successful in isolating elephants that exhibit consistency thus making them more attractive for traffic engineering applications

    New Perspectives in Sinographic Language Processing Through the Use of Character Structure

    Full text link
    Chinese characters have a complex and hierarchical graphical structure carrying both semantic and phonetic information. We use this structure to enhance the text model and obtain better results in standard NLP operations. First of all, to tackle the problem of graphical variation we define allographic classes of characters. Next, the relation of inclusion of a subcharacter in a characters, provides us with a directed graph of allographic classes. We provide this graph with two weights: semanticity (semantic relation between subcharacter and character) and phoneticity (phonetic relation) and calculate "most semantic subcharacter paths" for each character. Finally, adding the information contained in these paths to unigrams we claim to increase the efficiency of text mining methods. We evaluate our method on a text classification task on two corpora (Chinese and Japanese) of a total of 18 million characters and get an improvement of 3% on an already high baseline of 89.6% precision, obtained by a linear SVM classifier. Other possible applications and perspectives of the system are discussed.Comment: 17 pages, 5 figures, presented at CICLing 201

    The Dwarf Spheroidal Companions to M31: Variable Stars in Andromeda VI

    Full text link
    We have surveyed Andromeda VI, a dwarf spheroidal galaxy companion to M31, for variable stars using F450W and F555W observations obtained with the Hubble Space Telescope. A total of 118 variables were found, with 111 being RR Lyrae, 6 anomalous Cepheids, and 1 variable we were unable to classify. We find that the Andromeda VI anomalous Cepheids have properties consistent with those of anomalous Cepheids in other dwarf spheroidal galaxies. We revise the existing period-luminosity relations for these variables. Further, using these and other available data, we show that there is no clear difference between fundamental and first-overtone anomalous Cepheids in a period-amplitude diagram at shorter periods, unlike the RR Lyrae. For the Andromeda VI RR Lyrae, we find that they lie close to the Oosterhoff type I Galactic globular clusters in the period-amplitude diagram, although the mean period of the RRab stars, = 0.588 d, is slightly longer than the typical Oosterhoff type I cluster. The mean V magnitude of the RR Lyrae in Andromeda VI is 25.29+/-0.03, resulting in a distance 815+/-25 kpc on the Lee, Demarque, & Zinn distance scale. This is consistent with the distance derived from the I magnitude of the tip of the red giant branch. Similarly, the properties of the RR Lyrae indicate a mean abundance for Andromeda VI which is consistent with that derived from the mean red giant branch color.Comment: 23 pages, including 13 figures and 6 tables, emulateapj5/apjfonts style. Accepted by the Astronomical Journal. We recommend the interested reader to download the preprint with full-resolution figures, which can be found at http://www.noao.edu/noao/staff/pritzl/M31dwarfs.htm

    Heisenberg realization for U_q(sln) on the flag manifold

    Get PDF
    We give the Heisenberg realization for the quantum algebra Uq(sln)U_q(sl_n), which is written by the qq-difference operator on the flag manifold. We construct it from the action of Uq(sln)U_q(sl_n) on the qq-symmetric algebra Aq(Matn)A_q(Mat_n) by the Borel-Weil like approach. Our realization is applicable to the construction of the free field realization for the Uq(sln^)U_q(\widehat{sl_n}) [AOS].Comment: 10 pages, YITP/K-1016, plain TEX (some mistakes corrected and a reference added
    • 

    corecore